منابع مشابه
Long Cycles in Hamiltonian Graphs
We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.
متن کاملLong cycles in critical graphs
It is shown that any k-critical graph with n vertices contains a cycle of length at least 2 p log (nÿ 1)/log(kÿ 2), improving a previous estimate of Kelly and Kelly obtained in 1954. ß 2000 John Wiley & Sons, Inc. J Graph Theory 35: 193±196, 2000
متن کاملFinding long cycles in graphs
We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechanics and relies on a message passing procedure. The second follows a more standard Monte Carlo Markov chain strategy. Special attention is devoted to Hamiltonian cycles of (nonregular) random graphs of minimal connectiv...
متن کاملLong Cycles in 3-Connected Graphs
Moon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, then G contains a cycle of length at least Ω(nlog3 2). In this paper, this conjecture is proved. In addition, the same result is proved for 3-connected graphs embeddable in the projective plane, or the torus, or the Klein bottle. MSC Primary 05C38 and 05C50 Secondary 57M15 Partially supported by NSA grant ...
متن کاملLong cycles in 3-cyclable graphs
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min{n, 3δ− 3, n+ δ − α}.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Chemistry
سال: 2008
ISSN: 0259-9791,1572-8897
DOI: 10.1007/s10910-008-9495-z